Service Competition with General Queueing Facilities
نویسندگان
چکیده
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A firm’s waiting-time standard may either be defined in terms of the expected value or a given, for example 95%, percentile of the steady state waiting-time distribution. We investigate how a service industry’s competitive behavior depends on the characteristics of the service providers’ queueing systems. We provide a unifying approach to investigate various standard single-stage systems covering the spectrum from M/M/1 to general G/GI/s systems, along with open Jackson networks to represent multistage service systems. Assuming that the capacity cost is proportional with the service rates, we refer to its dependence on (i) the firm’s demand rate, and (ii) the waiting-time standard as the capacity cost function. We show that across the above broad spectrum of queueing models, the capacity cost function belongs to a specific four-parameter class of function, either exactly or as a close approximation. We then characterize how this capacity cost function impacts the equilibrium behavior in the industry. We give separate treatments to the case where the firms compete in terms of (i) prices (only), (ii) their service level or waiting-time standard (only), and (iii) simultaneously in terms of both prices and service levels. The firms’ demand rates are given by a general system of equations of the prices and waiting-time standards in the industry.
منابع مشابه
Fuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملCompetition in Service Industries
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience, as well as different attributes not determined directly through competition. Our model therefore assumes that the expected demand experienced by a given firm may depend on all of the industry’s price levels as well as ...
متن کاملMachine Repair Queueing System with with Non-Reliable Service Stations And Heterogeneous Service Discipline (RESEARCH NOTE)
This investigation deals with M/M/R/N machine repair problem with R non-reliable service stations which are subjected to unpredictable breakdown. 1here is provision of an additional server to reduce backlog in the case of heavy load of failed machines. 1he permanent service stations repair the failed machines at an identical rate m and switch to faster repair rate when all service stations are ...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 56 شماره
صفحات -
تاریخ انتشار 2008